A Complete Promise Problem for Statistical Zero-Knowledge
نویسندگان
چکیده
We present a complete promise problem for SZK, the class of languages possessing statistical zero-knowledge proofs (against an honest verifier). The problem is to decide whether two efficiently samplable distributions are either statisticallyclose or far apart. This characterizes SZK with no reference to interaction or zero-knowledge. From this theorem and its proof, we are able to establish several other results about SZK, knowledge complexity, and efficiently samplable distributions.
منابع مشابه
imits on the Power of Quantum Statistical Zero-Knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV . We prove several facts regarding this class, including: The following problem is a complete promise problem for QSZKHV : given instructions for preparing two mixed quantum states, are the states close together...
متن کاملLimits on the power of quantum statistical zero-knowledge
In this paper we propose a definition for honest verifier quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including: • The following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together o...
متن کاملQuantum statistical zero-knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK. We prove several facts regarding this class: • The following natural problem is a complete promise problem for QSZK: given instructions for preparing two mixed quantum states, are the states close together or far...
متن کاملCan Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
We extend the study of non-interactive statistical zeroknowledge proofs. Our main focus is to compare the class NISZK of problems possessing such non-interactive proofs to the class SZK of problems possessing interactive statistical zero-knowledge proofs. Along these lines, we first show that if statistical zero knowledge is non-trivial then so is non-interactive statistical zero knowledge, whe...
متن کاملComplete Problem for Perfect Zero-Knowledge Quantum Proof
The main purpose of this paper is to prove that (promise) problem Quantum State Identicalness (abbreviated QSI) is essentially complete for perfect zero-knowledge quantum interactive proof (QPZK). Loosely speaking, problem QSI is to decide whether two efficiently preparable quantum states (captured by quantum circuit of polynomial size) are identical or far apart (in trace distance). It is wort...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997